Quantitative Relations and Approximate Process Equivalences
نویسندگان
چکیده
We introduce a characterisation of probabilistic transition systems (PTS) in terms of linear operators on some suitably defined vector space representing the set of states. Various notions of process equivalences can then be re-formulated as abstract linear operators related to the concrete PTS semantics via a probabilistic abstract interpretation. These process equivalences can be turned into corresponding approximate notions by identifying processes whose abstract operators “differ” by a given quantity, which can be calculated as the norm of the difference operator. We argue that this number can be given a statistical interpretation in terms of the tests needed to distinguish two behaviours.
منابع مشابه
Measuring the confinement of probabilistic systems
In this paper we lay the semantic basis for a quantitative security analysis of probabilistic systems by introducing notions of approximate confinement based on various process equivalences. We re-cast the operational semantics classically expressed via probabilistic transition systems (PTS) in terms of linear operators and we present a technique for defining approximate semantics as probabilis...
متن کاملQuotient G-systems and Green\'s Relations
In this paper, we first introduce the concepts of G-systems, quotient G-systems and isomorphism theorems on G-systems of n-ary semihypergroups . Also we consider the Green's equivalences on G-systems and further in-vestigate some of their properties. A number of n-ary semihypergroups are constructed and presented as examples in this paper.
متن کاملApproximate equality is no fuzzy equality
We argue that fuzzy equivalences, and in particular fuzzy equalities, in general are not suitable to model approximate equality due to the notion of transitivity. Using them for this purpose therefore leads to counter-intuitive results, as we illustrate in detail in a fuzzy relationbased framework for the representation of linguistic modifiers. We solve the problem by choosing resemblance relat...
متن کاملar X iv : 0 80 6 . 49 56 v 1 [ cs . L O ] 3 0 Ju n 20 08 GAME REFINEMENT RELATIONS AND METRICS
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves. Given a goal (e.g., " reach a target state "), the question of winning is thus a probabilistic o...
متن کاملOn Approximate Equivalences of Multigranular Rough Sets and Approximate Reasoning
The notion of rough sets introduced by Pawlak has been a successful model to capture impreciseness in data and has numerous applications. Since then it has been extended in several ways. The basic rough set introduced by Pawlak is a single granulation model from the granular computing point of view. Recently, this has been extended to two types of multigranular rough set models. Pawlak and Novo...
متن کامل